Note on equivalence of cutpoint languages recognized by measure many quantum finite automata
نویسنده
چکیده
This note revisits the equivalence of languages recognized by measure many one way quantum finite automata with non/strict cutpoint. The main contributions are as follows: (1) We provide an additional proof of the undecidability of non/strict emptiness of measure many one way quantum finite automata; (2) By the undecidability of non/strict emptiness of measure many one way quantum finite automata, we show that the equivalence of languages recognized by measure many one way quantum finite automata with non/strict cutpoint is undecidable, implying the undecidability of containment problem of measure many one way quantum finite automata
منابع مشابه
On equivalence and emptiness problems of multi-letter (measure many) quantum finite automata
On equivalence and emptiness problems of multi-letter (measure many) quantum finite automata Abstract In this paper, we study some decision problems both for multi-letter quantum finite au-tomata and measure many multi-letter quantum finite automata. We first show that given a k1-letter quantum finite automaton A1 and a k2-letter quantum finite automaton A2 over the same input alphabet Σ, they ...
متن کاملOn languages not recognizable by One-way Measure Many Quantum Finite automaton
Measure Many Quantum Finite Automaton is not the strongest known model of quantum automaton but, it is still an open question what is the class of languages recognized by it when only bounded error probability is allowed. In this paper a natural class of ”word set” regular languages are studied. A proof that in general case the class can not be recognized by One-way model of Measure Many Quantu...
متن کاملQuantum Finite Automata with One-Sided Unbounded Error
We prove that several variants of the quantum finite automaton (QFA) model are strictly superior to their probabilistic counterparts, in terms of both language recognition power and succinctness, in the one-sided unbounded error setting. This is the first case where one-way QFA models have been shown to outperform the corresponding probabilistic automata in both these respects. We give a charac...
متن کاملQuantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
We study the recognition of R-trivial idempotent (R1) languages by various models of ”decide-and-halt” quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model which generalizes both Nayak’s enhanced QFA and DH-PRA. We apply tools from algebraic automata theory and systems of linear inequalities to give a complete characteriz...
متن کاملDetermining the equivalence for 1 - way quantum finite automata ∗
Two quantum finite automata are equivalent if for any input string x the two automata accept x with equal probability. In this paper, we focus on determining the equivalence for 1-way quantum finite automata with control language (CL-1QFAs) defined by Bertoni et al and measure-many 1-way quantum finite automata (MM-1QFAs) introduced by Kondacs and Watrous. It is worth pointing out that although...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013